model checking - определение. Что такое model checking
DICLIB.COM
Языковые инструменты на ИИ
Введите слово или словосочетание на любом языке 👆
Язык:     

Перевод и анализ слов искусственным интеллектом

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое model checking - определение

VERIFYING WHETHER A FINITE-STATE MODEL MEETS A GIVEN SPECIFICATION
Temporal logic in finite-state verification; Temporal Logic in Finite-State Verification; Model checker; Symbolic model verification; Model checkers; Symbolic Model Verification; Model-checking; Model-checker; Symbolic model checking; Modelchecking
  • LTL]].</ref> and liveness properties, like ''"Whenever the n<sup>th</sup> floor's ''call'' button is pressed, the cabin will eventually stop at the n<sup>th</sup> floor and open the door"''.

model checking         
<theory, algorithm, testing> To algorithmically check whether a program (the model) satisfies a specification. The model is usually expressed as a directed graph consisting of nodes (or vertices) and edges. A set of atomic propositions is associated with each node. The nodes represents states of a program, the edges represent possible executions which alters the state, while the atomic propositions represent the basic properties that hold at a point of execution. A specification language, usually some kind of {temporal logic}, is used to express properties. The problem can be expressed mathematically as: given a temporal logic formula p and a model M with initial state s, decide if M,s models p. ["Automatic verification of finite state concurrent systems using temporal logic", E.M. Clarke, E.A. Emerson, and A.P. Sisla, ACM Trans. on Programming Languages and Systems 8(2), pp. 244--263, 1986]. (1997-06-26)
Model checking         
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash).
Abstract model checking         
Abstraction model checking
In computer science and in mathematics, abstraction model checking is for systems where an actual representation is too complex in developing the model alone. So, the design undergoes a kind of translation to scaled down "abstract" version.

Википедия

Model checking

In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash).

In order to solve such a problem algorithmically, both the model of the system and its specification are formulated in some precise mathematical language. To this end, the problem is formulated as a task in logic, namely to check whether a structure satisfies a given logical formula. This general concept applies to many kinds of logic and many kinds of structures. A simple model-checking problem consists of verifying whether a formula in the propositional logic is satisfied by a given structure.